Scheduling for Parallel Dedicated Machines with a Single Server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule isNP -hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst-case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two-machine flow shop and the open shop problems with a single server are also shown to be NP -hard in the strong sense. However, we reduce the two-machine flow shop no-wait problem with a single server to the Gilmore–Gomory traveling salesman problem and solve it in polynomial time. c © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000